Verification of Hybrid Controlled Processing Systems based on Decomposition and Deduction

While formal verification has been successfully used to analyze several academic examples of controlled hybrid systems, the application to real-world processing systems is largely restricted by the complexity of modeling and computation. This contribution aims at improving the applicability by using decomposition and deduction techniques: A given system is first decomposed into a set of physical and/or functional units and modeled by communicating timed automata or linear hybrid automata. The so-called Assumption/Commitment method allows to formulate requirements for the desired behavior of single modules or groups of modules. Model-Checking is an appropriate technique to analyze whether the requirements (e.g. the exclusion of critical states) are fulfilled. By combining the analysis results obtained for single modules, properties of composed modules can be deduced. As illustrated for a laboratory plant, properties of the complete system for which direct modelchecking is prohibitively expensive can be inferred by the iterative application of analysis and deduction. Keywords— Abstraction, Assumption/Commitment, Deductive Analysis, Discrete Controller, Hybrid System, Verification.